Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
نویسندگان
چکیده
منابع مشابه
Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine. This candidate has the property that, under the test hypotheses used, the implementation is correct if a...
متن کاملGenerating Candidates when testing a deterministic implementation against a Non-deterministic Finite State Machine
متن کامل
Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine that models the required behaviour of a system. We show that these methods can be extended if it is known that the implementation is equivalent to some (unknown) deterministic finite state machine. When testing a deterministic implementation, the test output provides inf...
متن کاملTesting conformance of a deterministic implementation against a non-deterministic stream X-machine
Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which produces a test that is guaranteed to determine correctness under certain design for test conditions. This test generation algorithm has recently b...
متن کاملAdaptive testing of a deterministic implementation against a nondeterministic nite state machine
A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic nite state machine that mod els the required behaviour of a system We show that these methods can be extended if it is known that the implementation is equivalent to some unknown deterministic nite state machine When testing a deterministic implementation the test output provides information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2003
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/46.3.307